Building-block Identification by Simultaneity Matrix
نویسندگان
چکیده
منابع مشابه
Building-Block Identification by Simultaneity Matrix
We propose a BB identification by simultaneity matrix (BISM) algorithm. The input is a set of -bit solutions denoted by S. The number of solutions is denoted by n = |S|. The output is a partition of bit positions {0, . . . , − 1}. The BISM is composed of Simultaneity-Matrix-Construction and Fine-Valid-Partition algorithms. Algorithm SMC is outlined as follows (aij denotes the matrix element at ...
متن کاملA Note on Building-block Identification by Simultaneity Matrix
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of solutions. In simple GA, crossover operator plays an important role in mixing BBs. However, the crossover probably disrupts the BBs because the cut point is chosen at random. Therefore the BBs need to be identified expli...
متن کاملChi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of solutions. In simple GA, crossover operator plays an important role in mixing BBs. However, the crossover probably disrupts the BBs because the cut point is chosen at random. Therefore the BBs need to be identified expli...
متن کاملIdentification of Building Facade’s Functions by Using Fuzzy TOPSIS Technique
Housing is viewed as a collection of characteristics that are used to satisfy goals, such as comfort and visual quality. Identifying the most important functions of facade results in improving quality. In this regard, the facade plays a crucial role in creating the borders of inner space in contact with its surroundings and can be considered as an interface. This study aimed to investigate and ...
متن کاملSimultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i and j. To exploit the matrix, we partition {0, . . . , − 1} by putting i and j in the same partition subset if mij is significantly high. The partition represents the bit positions of building blocks (BBs). The partiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2006
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-006-0097-z